A Generic Framework For Smoothness Terms Of Arbitrary Order
نویسندگان
چکیده
Statement Hereby I confirm that this thesis is my own work and that I have documented all sources used. Herewith I agree that my thesis will be made available through the library of the Com-2 Acknowledgements I want to thank the following people who made this work possible: Prof. Joachim Weickert for accepting my proposal as the topic of my Master's Thesis. Prof. Andrés Bruhn for again agreeing to become my second reviewer. Dr. Stephan Didas for allowing me now for the third time to reuse the source code he provided me with during my Bachelor's thesis. The staff of the LTM (Lehrstuhl für technische Mechanik) at Saarland University for allowing me to use their license of Vic-2D. In particular I want to thank Tobias Scheffer and Henning Seibert for their great support and very helpful feedback. I also want to thank my friends and my family who supported me during my research.
منابع مشابه
A General Framework for Subexponential Discrete Logarithm Algorithms
We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for nite elds and class groups of number and function elds which were proposed for use in cryptography. In class groups, our algor...
متن کاملCharacterization of Sobolev Spaces of Arbitrary Smoothness Using Nonstationary Tight Wavelet Frames
In this paper we shall characterize Sobolev spaces of an arbitrary order of smoothness using nonstationary tight wavelet frames for L2(R). In particular, we show that a Sobolev space of an arbitrary fixed order of smoothness can be characterized in terms of the weighted `2-norm of the analysis wavelet coefficient sequences using a fixed compactly supported nonstationary tight wavelet frame in L...
متن کاملA Degree Estimate for PolynomialSubdivision Surfaces of Higher RegularitybyUlrich
Subdivision algorithms can be used to construct smooth surfaces from control meshes of arbitrary topological structure. However, in contrast to tangent plane continuity, which is well understood, very little is known about the generation of subdivision surfaces of higher regularity. This work presents an estimate for piecewise polynomial subdivision surfaces by pointing out that curvature conti...
متن کاملNumerical simulation of transient natural gas flow in pipelines using high order DG-ADER scheme
To increase the numerical accuracy in solving engineering problems, either conventional methods on a fine grid or methods with a high order of accuracy on a coarse grid can be used. In the present research, the second approach is utilized and the arbitrary high order Discontinues Galerkin Arbitrary DERivative (DG-ADER) method is applied to analyze the transient isothermal flow of natural gas th...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملInvariant smoothness measures for surfaces
Two novel smoothness measures for surfaces are presented in this paper. The second and third order smoothness are defined as the squared normal curvature and the squared variation in normal curvature integrated over all directions in the tangent plane. Both quantities are truly geometric in the sense that they are invariant with respect to the actual parametrization of the surface. All the same...
متن کامل